A Taxonomy of Theorem-Proving Strategies
نویسنده
چکیده
This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. It covers forwardreasoning ordering-based strategies and backward-reasoning subgoal-reduction strategies, which do not appear together often. Unlike traditional presentations that emphasize logical inferences, this classification strives to give equal weight to the inference and search components of theorem proving, which are equally important in practice. For this purpose, a formal notion of search plan is given and shown to apply to all classes of strategies. For each class, the form of derivation is specified, and it is shown how inference system and search plan cooperate to generate it.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملExtending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general schema for applying resolution provers and propose a new search strategy ”chain resolution” tailored for large ontologies. Chain resolution is an extension of the standard resolution algorithm. The main idea of the exten...
متن کاملA fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملA Classification of Dialogue Actions in Tutorial Dialogue
In this paper we present a taxonomy of dialogue moves which describe the actions that students and tutors perform in tutorial dialogue. We are motivated by the need for a categorisation of such actions in order to develop computational models for tutorial dialogue. As such, we build both on existing work on dialogue move categorisation for tutorial dialogue as well as dialogue taxonomies for ge...
متن کاملRepresenting Variability in Product Lines: A Survey of Modeling and Specification Techniques
Software product lines are increasingly used to develop safety-critical and missioncritical systems. To reason about the correctness of product lines, researchers have developed special testing techniques and adapted formal verification techniques such as model checking and theorem proving to the requirements of software product lines. Existing research has focused on the strategies to enable e...
متن کامل